A Recursive Embedding Approach to Median Graph Computation
نویسندگان
چکیده
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Nevertheless, its computation is extremely complex. Several approaches have been presented up to now based on different strategies. In this paper we present a new approximate recursive algorithm for median graph computation based on graph embedding into vector spaces. Preliminary experiments on three databases show that this new approach is able to obtain better medians than the previous existing approaches.
منابع مشابه
A generic framework for median graph computation based on a recursive embedding approach
The median graph has been shown to be a good choice to obtain a representative of a set of graphs. However, its computation is a complex problem. Recently, graph embedding into vector spaces has been proposed to obtain approximations of the median graph. The problem with such an approach is how to go from a point in the vector space back to a graph in the graph space. The main contribution of t...
متن کاملGeneralized median graph computation by means of graph embedding in vector spaces
The median graph has been presented as a useful tool to represent a set of graphs. Nevertheless its computation is very complex and the existing algorithms are restricted to use limited amount of data. In this paper we propose a new approach for the computation of the median graph based on graph embedding. Graphs are embedded into a vector space and the median is computed in the vector domain. ...
متن کاملA comparison between two representatives of a Set of Graphs: Median vs Barycenter Graph
In this paper we consider two existing methods to generate a representative of a given set of graphs, that satisfy the following two conditions. On the one hand, that they are applicable to graphs with any kind of labels in nodes and edges and on the other hand, that they can handle relatively large amount of data. Namely, the approximated algorithms to compute the Median Graph via graph embedd...
متن کاملA Recursive Aigorithm for Lossless Embedding of Non-Passive systems
TIle lossless embedding problem for !he c1ass of reaJ and non-contractive scanering matrices, and hence for non-passive systems is addressed. The approach is ba<;ed on a modified LIS model. A recursive Schur-type algori!hm will be devised, which enables !he computation of the lossless emhedding for arbitrary scattering matrices including !he boundary case of scattering matrices with si ngular v...
متن کاملMedian computation in graphs using consensus strategies
Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of profiles. A review of algorithms for median computation on median graphs is discussed and their time complexities are compared. Implementation of the consensus strateg...
متن کامل